Compressed Chemistry
نویسندگان
چکیده
منابع مشابه
"Compressed" compressed sensing
The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an even smaller number of samples is sufficient when there exists prior knowledge about the distribution of the unknown vector, or when only partial recovery is...
متن کاملThe free-radical chemistry of polyethylene glycol: organic reactions in compressed carbon dioxide.
The thermal oxidative degradation of polyethylene glycol (PEG) is known to occur in an oxygen atmosphere at elevated temperatures. In this study, PEG radicals assumed to result from thermal oxidative degradation are successfully applied, in combination with compressed CO(2), to initiate a range of free-radical reactions, such as selective formylation of primary and secondary aliphatic alcohols,...
متن کاملCompressed Counting Meets Compressed Sensing
Compressed1 sensing (sparse signal recovery) has been a popular and important research topic in recent years. By observing that natural signals are often nonnegative, we propose a new framework for nonnegative signal recovery using Compressed Counting (CC). CC is a technique built on maximally-skewed α-stable random projections originally developed for data stream computations. Our recovery pro...
متن کاملA Compressed Introduction to Compressed Sensing
We attempt to convey a sense of compressed sensing. Specifically, we discuss how `1 minimization and the restricted isometry property for matrices can be used for sparse recovery of underdetermined linear systems even in the presence of noise.
متن کاملCompressed Membership in Automata with Compressed Labels
The algorithmic problem of whether a compressed string is accepted by a (nondeterministic) finite state automaton with compressed transition labels is investigated. For string compression, straight-line programs (SLPs), i.e., contextfree grammars that generate exactly one string, are used. Two algorithms for this problem are presented. The first one works in polynomial time, if all transition l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1969
ISSN: 0028-0836,1476-4687
DOI: 10.1038/223107b0